0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_int
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n147.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 18:52:39 CST 2018
0.00/0.28	% done 89 iterations in 0.081s
0.00/0.28	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.28	% SZS output start Refutation
0.00/0.28	tff('thm/sets/EXTENSION_', axiom,
0.00/0.28	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.28	     ((A0 = A1) <=>
0.00/0.28	      (![A2:A]: ('const/sets/IN'(A,A2,A0) <=> 'const/sets/IN'(A,A2,A1)))))).
0.00/0.28	tff('0', plain,
0.00/0.28	    ![X13 : $tType, X16 : X13 > $o, X18 : X13 > $o]:
0.00/0.28	      (X16 = X18
0.00/0.28	       | 'const/sets/IN'(X13, sk_A21(X13, X18, X16), X18)
0.00/0.28	       | 'const/sets/IN'(X13, sk_A21(X13, X18, X16), X16)),
0.00/0.28	    inference('cnf', [status(esa)], [thm/sets/EXTENSION_])).
0.00/0.28	tff('thm/sets/NOT_IN_EMPTY_', axiom,
0.00/0.28	  (![A:$tType,A0:A]: (~'const/sets/IN'(A,A0,'const/sets/EMPTY'(A))))).
0.00/0.28	tff('1', plain,
0.00/0.28	    ![X2 : $tType, X3 : X2]:
0.00/0.28	      ~ 'const/sets/IN'(X2, X3, 'const/sets/EMPTY'(X2)),
0.00/0.28	    inference('cnf', [status(esa)], [thm/sets/NOT_IN_EMPTY_])).
0.00/0.28	tff('2', plain,
0.00/0.28	    ![X0 : $tType, X1 : X0 > $o]:
0.00/0.28	      (~ $true
0.00/0.28	       | 'const/sets/IN'(X0, sk_A21(X0, 'const/sets/EMPTY'(X0), X1), X1)
0.00/0.28	       | X1 = 'const/sets/EMPTY'(X0)),
0.00/0.28	    inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.28	tff('3', plain,
0.00/0.28	    ![X0 : $tType, X1 : X0 > $o]:
0.00/0.28	      (X1 = 'const/sets/EMPTY'(X0)
0.00/0.28	       | 'const/sets/IN'(X0, sk_A21(X0, 'const/sets/EMPTY'(X0), X1), X1)),
0.00/0.28	    inference('simplify', [status(thm)], ['2'])).
0.00/0.28	tff('thm/sets/EMPTY_UNIONS_', conjecture,
0.00/0.28	  (![A:$tType,A0:(A > $o > $o)]:
0.00/0.28	     (('const/sets/UNIONS'(A,A0) = 'const/sets/EMPTY'(A)) <=>
0.00/0.28	      (![A1:(A > $o)]:
0.00/0.28	         ('const/sets/IN'(A > $o,A1,A0) => (A1 = 'const/sets/EMPTY'(A))))))).
0.00/0.28	tff(zf_stmt_0, negated_conjecture,
0.00/0.28	  (~
0.00/0.28	    (![A:$tType,A0:(A > $o > $o)]:
0.00/0.28	       (('const/sets/UNIONS'(A,A0) = 'const/sets/EMPTY'(A)) <=>
0.00/0.28	        (![A1:(A > $o)]:
0.00/0.28	           ('const/sets/IN'(A > $o,A1,A0) => (A1 = 'const/sets/EMPTY'(A)))))))).
0.00/0.28	tff('4', plain,
0.00/0.28	    ('const/sets/IN'((> $o, sk_A), sk_A1, sk_A0)
0.00/0.28	     | 'const/sets/UNIONS'(sk_A, sk_A0) != 'const/sets/EMPTY'(sk_A)),
0.00/0.28	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.28	tff('thm/sets/IN_UNIONS_', axiom,
0.00/0.28	  (![A:$tType,A0:(A > $o > $o),A1:A]:
0.00/0.28	     ('const/sets/IN'(A,A1,'const/sets/UNIONS'(A,A0)) <=>
0.00/0.28	      (?[A2:(A > $o)]:
0.00/0.28	         ('const/sets/IN'(A,A1,A2) & 'const/sets/IN'(A > $o,A2,A0)))))).
0.00/0.28	tff('5', plain,
0.00/0.29	    ![X8 : $tType, X10 : X8 > $o > $o, X11 : X8, X12 : X8 > $o]:
0.00/0.29	      ('const/sets/IN'(X8, X11, 'const/sets/UNIONS'(X8, X10))
0.00/0.29	       | ~ 'const/sets/IN'((> $o, X8), X12, X10)
0.00/0.29	       | ~ 'const/sets/IN'(X8, X11, X12)),
0.00/0.29	    inference('cnf', [status(esa)], [thm/sets/IN_UNIONS_])).
0.00/0.29	tff('6', plain,
0.00/0.29	    ![X0 : sk_A]:
0.00/0.29	      (~ $true
0.00/0.29	       | 'const/sets/UNIONS'(sk_A, sk_A0) != 'const/sets/EMPTY'(sk_A)
0.00/0.29	       | ~ 'const/sets/IN'(sk_A, X0, sk_A1)
0.00/0.29	       | 'const/sets/IN'(sk_A, X0, 'const/sets/UNIONS'(sk_A, sk_A0))),
0.00/0.29	    inference('sup-', [status(thm)], ['4', '5'])).
0.00/0.29	tff('7', plain,
0.00/0.29	    ![X0 : sk_A]:
0.00/0.29	      ('const/sets/IN'(sk_A, X0, 'const/sets/UNIONS'(sk_A, sk_A0))
0.00/0.29	       | ~ 'const/sets/IN'(sk_A, X0, sk_A1)
0.00/0.29	       | 'const/sets/UNIONS'(sk_A, sk_A0) != 'const/sets/EMPTY'(sk_A)),
0.00/0.29	    inference('simplify', [status(thm)], ['6'])).
0.00/0.29	tff('8', plain,
0.00/0.29	    ![X8 : $tType, X9 : X8, X10 : X8 > $o > $o]:
0.00/0.29	      ('const/sets/IN'((> $o, X8), sk_A2(X8, X9, X10), X10)
0.00/0.29	       | ~ 'const/sets/IN'(X8, X9, 'const/sets/UNIONS'(X8, X10))),
0.00/0.29	    inference('cnf', [status(esa)], [thm/sets/IN_UNIONS_])).
0.00/0.29	tff('9', plain,
0.00/0.29	    ![X19 : sk_A > $o]:
0.00/0.29	      (~ 'const/sets/IN'((> $o, sk_A), X19, sk_A0)
0.00/0.29	       | X19 = 'const/sets/EMPTY'(sk_A)
0.00/0.29	       | 'const/sets/UNIONS'(sk_A, sk_A0) = 'const/sets/EMPTY'(sk_A)),
0.00/0.29	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.29	tff('10', plain,
0.00/0.29	    ![X0 : sk_A]:
0.00/0.29	      (~ $true
0.00/0.29	       | ~ 'const/sets/IN'(sk_A, X0, 'const/sets/UNIONS'(sk_A, sk_A0))
0.00/0.29	       | 'const/sets/UNIONS'(sk_A, sk_A0) = 'const/sets/EMPTY'(sk_A)
0.00/0.29	       | sk_A2(sk_A, X0, sk_A0) = 'const/sets/EMPTY'(sk_A)),
0.00/0.29	    inference('sup-', [status(thm)], ['8', '9'])).
0.00/0.29	tff('11', plain,
0.00/0.29	    ![X0 : sk_A]:
0.00/0.29	      (sk_A2(sk_A, X0, sk_A0) = 'const/sets/EMPTY'(sk_A)
0.00/0.29	       | 'const/sets/UNIONS'(sk_A, sk_A0) = 'const/sets/EMPTY'(sk_A)
0.00/0.29	       | ~ 'const/sets/IN'(sk_A, X0, 'const/sets/UNIONS'(sk_A, sk_A0))),
0.00/0.29	    inference('simplify', [status(thm)], ['10'])).
0.00/0.29	tff('12', plain,
0.00/0.29	    ![X8 : $tType, X9 : X8, X10 : X8 > $o > $o]:
0.00/0.29	      ('const/sets/IN'(X8, X9, sk_A2(X8, X9, X10))
0.00/0.29	       | ~ 'const/sets/IN'(X8, X9, 'const/sets/UNIONS'(X8, X10))),
0.00/0.29	    inference('cnf', [status(esa)], [thm/sets/IN_UNIONS_])).
0.00/0.29	tff('13', plain,
0.00/0.29	    ![X0 : sk_A]:
0.00/0.29	      ('const/sets/IN'(sk_A, X0, 'const/sets/EMPTY'(sk_A))
0.00/0.29	       | ~ 'const/sets/IN'(sk_A, X0, 'const/sets/UNIONS'(sk_A, sk_A0))
0.00/0.29	       | 'const/sets/UNIONS'(sk_A, sk_A0) = 'const/sets/EMPTY'(sk_A)
0.00/0.29	       | ~ 'const/sets/IN'(sk_A, X0, 'const/sets/UNIONS'(sk_A, sk_A0))),
0.00/0.29	    inference('sup+', [status(thm)], ['11', '12'])).
0.00/0.29	tff('14', plain,
0.00/0.29	    ![X0 : sk_A]:
0.00/0.29	      ('const/sets/UNIONS'(sk_A, sk_A0) = 'const/sets/EMPTY'(sk_A)
0.00/0.29	       | ~ 'const/sets/IN'(sk_A, X0, 'const/sets/UNIONS'(sk_A, sk_A0))
0.00/0.29	       | 'const/sets/IN'(sk_A, X0, 'const/sets/EMPTY'(sk_A))),
0.00/0.29	    inference('simplify', [status(thm)], ['13'])).
0.00/0.29	tff('15', plain,
0.00/0.29	    ![X0 : sk_A]:
0.00/0.29	      (~ 'const/sets/IN'(sk_A, X0, 'const/sets/UNIONS'(sk_A, sk_A0))
0.00/0.29	       | 'const/sets/UNIONS'(sk_A, sk_A0) = 'const/sets/EMPTY'(sk_A)),
0.00/0.29	    inference('clc', [status(thm)], ['14', '1'])).
0.00/0.29	tff('16', plain,
0.00/0.29	    (~ $true
0.00/0.29	     | 'const/sets/UNIONS'(sk_A, sk_A0) = 'const/sets/EMPTY'(sk_A)
0.00/0.29	     | 'const/sets/UNIONS'(sk_A, sk_A0) = 'const/sets/EMPTY'(sk_A)),
0.00/0.29	    inference('sup-', [status(thm)], ['3', '15'])).
0.00/0.29	tff('17', plain, 'const/sets/UNIONS'(sk_A, sk_A0) = 'const/sets/EMPTY'(sk_A),
0.00/0.29	    inference('simplify', [status(thm)], ['16'])).
0.00/0.29	tff('18', plain,
0.00/0.29	    ![X0 : sk_A]:
0.00/0.29	      ('const/sets/IN'(sk_A, X0, 'const/sets/EMPTY'(sk_A))
0.00/0.29	       | ~ 'const/sets/IN'(sk_A, X0, sk_A1)
0.00/0.29	       | 'const/sets/EMPTY'(sk_A) != 'const/sets/EMPTY'(sk_A)),
0.00/0.29	    inference('demod', [status(thm)], ['7', '17', '17'])).
0.00/0.29	tff('19', plain,
0.00/0.29	    ![X0 : sk_A]:
0.00/0.29	      (~ 'const/sets/IN'(sk_A, X0, sk_A1)
0.00/0.29	       | 'const/sets/IN'(sk_A, X0, 'const/sets/EMPTY'(sk_A))),
0.00/0.29	    inference('simplify', [status(thm)], ['18'])).
0.00/0.29	tff('20', plain, ![X0 : sk_A]: ~ 'const/sets/IN'(sk_A, X0, sk_A1),
0.00/0.29	    inference('clc', [status(thm)], ['19', '1'])).
0.00/0.29	tff('21', plain, (~ $true | sk_A1 = 'const/sets/EMPTY'(sk_A)),
0.00/0.29	    inference('sup-', [status(thm)], ['3', '20'])).
0.00/0.29	tff('22', plain, sk_A1 = 'const/sets/EMPTY'(sk_A),
0.00/0.29	    inference('simplify', [status(thm)], ['21'])).
0.00/0.29	tff('23', plain,
0.00/0.29	    (sk_A1 != 'const/sets/EMPTY'(sk_A)
0.00/0.29	     | 'const/sets/UNIONS'(sk_A, sk_A0) != 'const/sets/EMPTY'(sk_A)),
0.00/0.29	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.29	tff('24', plain,
0.00/0.29	    (sk_A1 != 'const/sets/EMPTY'(sk_A)
0.00/0.29	     | 'const/sets/EMPTY'(sk_A) != 'const/sets/EMPTY'(sk_A)),
0.00/0.29	    inference('demod', [status(thm)], ['23', '17'])).
0.00/0.29	tff('25', plain, sk_A1 != 'const/sets/EMPTY'(sk_A),
0.00/0.29	    inference('simplify', [status(thm)], ['24'])).
0.00/0.29	tff('26', plain, $false,
0.00/0.29	    inference('simplify_reflect-', [status(thm)], ['22', '25'])).
0.00/0.29	
0.00/0.29	% SZS output end Refutation
0.00/0.29	EOF
